Soft Time Windows Associated Vehicles Routing Problems of Logistics Distribution Center Using Genetic Simulated Annealing Algorithm
نویسندگان
چکیده
منابع مشابه
A multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملHybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows
The Vehicle Routing Problem with Time Windows (VRPTW) involves servicing a set of customers, with earliest and latest time deadlines, with varying demands using capacitated vehicles with limited travel times. The objective of the problem is to service all customers while minimizing the number of vehicles and travel distance without violating the capacity and travel time of the vehicles and cust...
متن کاملa multi-criteria vehicle routing problem with soft time windows by simulated annealing
this paper presents a multi-criteria vehicle routing problem with soft time windows (vrpstw) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. in this case, the fleet is heterogene-ous. the vrpstw consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. it is assumed that this relaxation a...
متن کاملApplication of Simulated Annealing to Routing Problems in City Logistics
The R & D activities to realize systems which provide road traffic information and route guidance have been conducted as core systems of Intelligent Transport Systems (ITS). However, the implementation of these systems will have less effect on freight transport unless logistics operation is rationalized in parallel to the development of ITS. On the other hand, according to the expansion of inte...
متن کاملChapter 9 A Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Heuristic for Vehicle Routing Problems with Time Windows
The vehicle routing problem with time windows (VRPTW) is an extension of the vehicle routing problem (VRP) with earliest, latest, and service times for customers. The VRPTW routes a set of vehicles to service customers having earliest, latest service times. The objective of the problem is to minimize the number of vehicles and the distance travelled to service the customers. The constraints of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2014
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.1002276